A compactly generated pseudogroup which is not realizable
نویسندگان
چکیده
منابع مشابه
Compactly generated Hausdorff locales
We say that a Hausdorff locale is compactly generated if it is the colimit of the diagram of its compact sublocales connected by inclusions. We show that this is the case if and only if the natural map of its frame of opens into the second Lawson dual is an isomorphism. More generally, for any Hausdorff locale, the second dual of the frame of opens gives the frame of opens of the colimit. In or...
متن کاملCompactly Generated Spaces
This document is a summary of basic facts about the “standard” category of compactly generated spaces introduced by McCord [McC69] (often referred to in the literature as “compactly generated weak Hausdorff spaces”, or “weak Hausdorff k-spaces”). The main references I’ve used for this material are Gaunce Lewis’s thesis [Lew, App. A], and Neil Strickland’s note [Str09] (especially for material a...
متن کاملCompactly generated domain theory
We propose compactly generated monotone convergence spaces as a well-behaved topological generalization of directed-complete partial orders (dcpos). The category of such spaces enjoys the usual properties of categories of “predomains” in denotational semantics. Moreover, such properties are retained if one restricts to spaces with a countable pseudobase in the sense of E. Michael, a fact that p...
متن کاملA Realizable Learning Task which Exhibits Overfitting
In this paper we examine a perceptron learning task. The task is realizable since it is provided by another perceptron with identical architecture. Both perceptrons have nonlinear sigmoid output functions. The gain of the output function determines the level of nonlinearity of the learning task. It is observed that a high level of nonlinearity leads to overfitting. We give an explanation for th...
متن کاملA convex polyhedron which is not equifacettable
A famous theorem due to E. Steinitz states, in one of its formulations, that every planar (or, equivalently, every spherical) graph can be realized as the graph of edges and vertices of a convex polyhedron in Euclidean 3-space (see, for example, Grünbaum [1, Section 13.1] or Ziegler [3, Chapter 4]). This representation is possible in many different ways, but in all of them the circuits that bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 2010
ISSN: 0025-5645
DOI: 10.2969/jmsj/06241205